#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n,ans;
int gs[N],dp[N];
bool flag[N];
bool cmp(int a,int b){
    return a<b;
}
signed main(){
    freopen("duel2.in","r",stdin);
    freopen("duel2.out","w",stdout);
    cin>>n;
    for(int i = 1;i<=n;i++)
        cin>>gs[i];
    sort(gs+1,gs+1+n,cmp);
    for(int i = 1;i<=n;i++){
        if(flag[i] == 0){
            for(int j = 1;j<=n;j++){
                if(flag[j] == 0){
                    if(gs[i]>gs[j]){
                        flag[i] = flag[j] = 1;
                        ans++;
                    }
                    if(gs[i]<gs[j]){
                        flag[i] = flag[j] = 1;
                        ans++;
                    }
                }
            }
        }
    }
    cout<<(n-ans);
    return 0;
}
/*Hello CCF! Hello Nfls! Hello word!! */
